Relaxing order basis computation
نویسندگان
چکیده
منابع مشابه
Efficient algorithms for order basis computation
In this paper we present two algorithms for the computation of a shifted order basis of an m×n matrix of power series over a field K with m ≤ n. For a given order σ and balanced shift ~s the first algorithm determines an order basis with a cost of O∼(nωdmσ/ne) field operations in K, where ω is the exponent of matrix multiplication. Here an input shift is balanced when max(~s)−min(~s) ∈ O(mσ/n)....
متن کاملOptimally Relaxing Partial-Order Plans with MaxSAT
Partial-order plans (POPs) are attractive because of their least commitment nature, providing enhanced plan flexibility at execution time relative to sequential plans. Despite the appeal of POPs, most of the recent research on automated plan generation has focused on sequential plans. In this paper we examine the task of POP generation by relaxing or modifying the action orderings of a plan to ...
متن کاملPractical Groebner Basis Computation
We report on our experiences exploring state of the art Gröbner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature based Gröbner basis algorithms and more traditional variations of the classic Buchberger algorithm. Our conclusions are based on experiments using our new fre...
متن کاملRelaxing Environmental Security: Monitored Functionalities and Client-Server Computation
Definition of security under the framework of Environmental Security (a.k.a Network-Aware Security or Universally Composable Security) typically requires “extractability” of the private inputs of parties running a protocol. Formalizing concepts that appeared in an earlier work [19], we introduce a framework of “Monitored Functionalities,” which allows us to avoid such a requirement from the sec...
متن کاملStability Computation via Gröbner Basis
In this article, we discuss a Gröbner basis algorithm related to the stability of algebraic varieties in the sense of Geometric Invariant Theory. We implement the algorithm with Macaulay 2, and give some applications to the moduli theory of curves. Given an algebraic group G acting on a projective variety X linearized by a line bundle L, the stability of a point x ∈ X can be determined by exami...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Communications in Computer Algebra
سال: 2014
ISSN: 1932-2240
DOI: 10.1145/2576802.2576813